Trisecting a rectangle
نویسندگان
چکیده
منابع مشابه
Trisecting non-Lagrangian theories
We propose a way to define and compute invariants of general smooth 4manifolds based on topological twists of non-Lagrangian 4d N = 2 and N = 3 theories in which the problem is reduced to a fairly standard computation in topological A-model, albeit with rather unusual targets, such as compact and non-compact Gepner models, asymmetric orbifolds, N = (2, 2) linear dilaton theories, “self-mirror” ...
متن کاملTrisecting representational states in short-term memory
The ability to hold information briefly in mind in the absence of external stimulation forms the core of much of higher-order cognition. This ability is referred to as short-term memory (STM). However, single-term labels such as this belie the complexity of the underlying construct. Here, we review evidence that STM is an amalgamation of three qualitatively distinct states. We argue that these ...
متن کاملFour bugs on a rectangle
References pa.2010.0506.full.html#ref-list-1 http://rspa.royalsocietypublishing.org/content/early/2010/11/09/rs This article cites 8 articles, 1 of which can be accessed free P<P journal. Published online 10 November 2010 in advance of the print Subject collections (268 articles) applied mathematics (74 articles) differential equations Articles on similar topics can be found in the follow...
متن کاملLattice points in a rectangle
Basically, what we can try to do is to take the Fourier transform of 1R (the indicator function for the set R), and then use Fourier inversion to show that for each shift t+L of the lattice L, this shift intersects the set R. Actually, it will not quite be enough to take the Fourier transform of just 1R, but instead we will need to work with a smoothed version of 1R in order to make the Fourier...
متن کاملTiling a Rectangle with Polyominoes
A polycube in dimension d is a finite union of unit d-cubes whose vertices are on knots of the lattice Zd . We show that, for each family of polycubes E, there exists a finite set F of bricks (parallelepiped rectangles) such that the bricks which can be tiled by E are exactly the bricks which can be tiled by F . Consequently, if we know the set F , then we have an algorithm to decide in polynom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1994
ISSN: 0097-3165
DOI: 10.1016/0097-3165(94)90049-3